Projection Methods for Oversized Linear Algebra Problems Projection Methods for Over

نویسنده

  • Jan Brandts
چکیده

Everybody who has some experience in doing mathematics knows, that dimensional reduction and projection are useful tools to confront problems that are too complicated to solve without any simplification. Who hasn’t, occasionally, but notwithstanding timidly, suggested that perhaps it would be a good idea to study the simple one-dimensional casefirst before trying tounderstand the real-world three-dimensional problem? Apparently, it is a wide-spread faith that such simplifications will not damage the essential mathematical or physical truth that is hidden in the original problem. But is this faith founded? Regardless of the answer, one should realize that in many applications there is no plausible alternative, so it would be unfair to judge too harshly on those who solve reduced problems and, with due mathematical care, formulate interesting and strong theorems and hypotheses on the full problem. Among them are the people from the field of numerical linear algebra.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Projection Inequalities and Their Linear Preservers

This paper introduces an inequality on vectors in $mathbb{R}^n$ which compares vectors in $mathbb{R}^n$ based on the $p$-norm of their projections on $mathbb{R}^k$ ($kleq n$). For $p>0$, we say $x$ is $d$-projectionally less than or equal to $y$ with respect to $p$-norm if $sum_{i=1}^kvert x_ivert^p$ is less than or equal to $ sum_{i=1}^kvert y_ivert^p$, for every $dleq kleq n$. For...

متن کامل

Mapping Strategies in Data Parallel Programming Models; the Projection Methods

We Analyze data parallel programming of some general purpose methods in linear algebra. Specifically , the projection methods to solve very large linear system and/or eigenproblem. The expensive parts of these methods are their projection phases. This portion of these algorithms has generally, a very simple structure for such a programming model. It is composed essentially of matrix-vector mult...

متن کامل

Modelling Decision Problems Via Birkhoff Polyhedra

A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...

متن کامل

Isolated Persian/Arabic handwriting characters: Derivative projection profile features, implemented on GPUs

For many years, researchers have studied high accuracy methods for recognizing the handwriting and achieved many significant improvements. However, an issue that has rarely been studied is the speed of these methods. Considering the computer hardware limitations, it is necessary for these methods to run in high speed. One of the methods to increase the processing speed is to use the computer pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000